RIA: An RF Intereference Avoidance Algorithm for Heteregeneous Wireless Networks
نویسندگان
چکیده
Due to the unlicensed nature of 2.4 GHz ISM band, the number of technologies using this band is growing. FCC regulations mandate that these technologies need to implement some form of frequency sharing. Direct Sequence Spread Spectrum (DSSS) and Frequency Hopping Spread Spectrum (FHSS) are two popular techniques to share the frequencies within this band. However, devices implementing different technologies may cause interference; this problem is well-documented as occurring with 802.11 (using DSSS) and Bluetooth (using FHSS). Designing an interference avoidance algorithm for combinations of these DSSS/FHSS based technologies is complex. In this paper, we focus on a simpler but very common case when these technologies are located within the same device. For this case, we propose a simple and novel algorithm called, Radio Interference Avoidance Algorithm, RIA, that solves the problem of interference between any arbitrary DSSS and FHSS technologies. In this paper we derive the expected value of response time for RIA. We then run simulations to demonstrate the effectiveness of RIA. Our results indicate that RIA is able to eliminate interference with a very small response time. RIA also outperforms Adaptive Frequency Hopping, a solution proposed by the IEEE 802.15 Co-existence Working Group.
منابع مشابه
Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملImproving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005